Balancing Communication in Ring-Structured Networks
نویسندگان
چکیده
We present a polynomial-time algorithm for nding an almost optimal solution to the following combinatorial problem, which is motivated by the problem of balancing communication in networks having the structure of rings. Input: a circle and a multiset of c chords, having n distinct endpoints, representing desired point-to-point communications; c 0 of the chords are distinct. The task: to map each chord to an arc having the same endpoints, in a way that minimizes the maximum number of arcs crossing any normal to the circle. Our algorithm operates in time O(n 2 c) and uses O(n + c 0) words of storage; it nds a mapping that is within +1 of optimal.
منابع مشابه
Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables
In Peer-to-Peer networks based on consistent hashing and ring topology each peer is responsible for an interval chosen (pseudo-) randomly on a circle. The topology of the network, the communication load and the amount of data a peer stores depends heavily on the length
متن کاملSimple dynamic load balancing mechanism for structured P2P network and its evaluation
Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficiently. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Waon uses a simple algorithm of load balancing and a routing table based on the number of hops between nodes t...
متن کاملA Structured Channel Borrowing Scheme for Dynamic Load Balancing in Cellular Networks
We propose an eecient dynamic load balancing scheme in cellular networks for managing tele-traac hot spot in which channel demand exceed a certain threshold. A hot spot, depicted as a stack of hexagonaìRings' of cells, is classiied as complete if all cells within it are hot. The rings containing only cold cells outside the hot spot are called`Peripheral Rings'. Our load balancing scheme migrate...
متن کاملA novel load balancing scheme for the tele-traffic hot spot problem in cellular networks
We propose a dynamic load balancing scheme for the tele-traac hot spot problem in cellular networks. A tele-traac hot spot is a region of adjacent hot cells where the channel demand has exceeded a certain threshold. A hot spot is depicted as a stack of hexagonaìRings' of cells and is classiied as complete if all cells within it are hot. Otherwise it is termed incomplete. The rings containing al...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کامل